Edge coloring complete uniform hypergraphs with many components
نویسندگان
چکیده
منابع مشابه
Edge coloring complete uniform hypergraphs with many components
Let H be a hypergraph. For a k-edge coloring c : E(H) → {1, . . . , k} let f(H, c) be the number of components in the subhypergraph induced by the color class with the least number of components. Let fk(H) be the maximum possible value of f(H, c) ranging over all k-edge colorings of H . If H is the complete graph Kn then, trivially, f1(Kn) = f2(Kn) = 1. In this paper we prove that for n ≥ 6, f3...
متن کاملColoring Uniform Hypergraphs with Small Edge Degrees
The degree of an edge e in a hypergraph G is the number of other edges of G intersecting e, and the maximum edge degree of G is the maximum over the degrees of its edges. A natural question is: Which bound on the maximum edge degree of an r-uniform hypergraph G provides that G is k-colorable? The classical result in this direction belongs to Erdős and Lovász. In their seminal paper [2] (where t...
متن کاملColoring uniform hypergraphs with few colors
Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k 2, then m(r, k) (k)k(r/ln r) . © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 24: 1–10, 2004
متن کاملColoring uniform hypergraphs with few edges
A hypergraph is b-simple if no two distinct edges share more than b vertices. Let m(r, t, g) denote the minimum number of edges in an r-uniform non-t-colorable hypergraph of girth at least g. Erdős and Lovász proved that m(r, t, 3) ≥ t 2(r−2) 16r(r − 1)2 and m(r, t, g) ≤ 4 · 20g−1r3g−5t(g−1)(r+1). A result of Szabó improves the lower bound by a factor of r2− for sufficiently large r. We improve...
متن کاملApproximate coloring of uniform hypergraphs
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2004
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.01.002